A Characterization of Infinite LSP Words
نویسنده
چکیده
G. Fici proved that a finite word has a minimal suffix automaton if and only if all its left special factors occur as prefixes. He called LSP all finite and infinite words having this latter property. We characterize here infinite LSP words in terms of S-adicity. More precisely we provide a finite set of morphisms S and an automaton A such that an infinite word is LSP if and only if it is S-adic and all its directive words are recognizable by A.
منابع مشابه
Rankers over Infinite Words
We consider the fragments FO, Σ2 ∩ FO, Π2 ∩ FO, and ∆2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of rankers. In particular, we generalize the notion of a ranker to infinite words in two possible ways. Both extensions are natural in the sense that over finite words, they coincide with classical rankers and over infinite ...
متن کاملCharacterizations of finite and infinite episturmian words via lexicographic orderings
In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a wide sense (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we character...
متن کاملValidity and reliability of Persian version of Listening Styles Profile-Revised (LSP- R) in Iranian students
Background: Individuals’ listening styles differs based on their characters, professions and situations. This study aimed to assess the validity and reliability of Listening Styles Profile- Revised (LSP- R) in Iranian students. Methods: After translating into Persian, LSP-R was employed in a sample of 240 medical and nursing Persian speaking students in Iran. Statistic...
متن کاملA characterization of infinite smooth Lyndon words
In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only ones? If no, what do the infinite smooth words that are also Lyndon words look like? In this paper, we give the answer, proving that the only infinite smooth Lyndon words are m{a<b}, with a, b even, m{1<b} and ∆ −1 1 ...
متن کاملInfinite Words and Confluent Rewriting Systems: Endomorphism Extensions
Infinite words over a finite special confluent rewriting system R are considered and endowed with natural algebraic and topological structures. Their geometric significance is explored in the context of Gromov hyperbolic spaces. Given an endomorphism φ of the monoid generated by R, existence and uniqueness of several types of extensions of φ to infinite words (endomorphism extensions, weak endo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017